Tradeoff Issues in Local Search Guidance for SAT
نویسنده
چکیده
What sets SAT apart from other combinatorial optimization problems is that SAT is basically a feasibility problem. Once a variable assignment is found that satisfies all the clauses (see Section 2), the problem is solved. There is thus no guidance from the objective function. Guidance is customarily instead based on the amount of infeasibility, usually by counting the number of unsatisfied clauses for a given solution vector.
منابع مشابه
Chapter 9 ADAPTIVE MEMORY SEARCH GUIDANCE FOR SATISFIABILITY PROBLEMS
Satisfiability problems (SAT) are capable of representing many important realworld problems, like planning, scheduling, and robotic movement. Efficient encodings exist for many of these applications and thus having good solvers for these problems is of critical significance. We look at how adaptive memory and surrogate constraint processes can be used as search guidance for both constructive an...
متن کاملCh-sat: a Complete Heuristic Procedure for Satissability Problems
This paper presents CH-SAT, a Complete Heuris-tic procedure for the SATissability problem (SAT) based on local search techniques. CH-SAT aims to combine the ee-ciency of local search and the completeness of memorizing-backtracking. CH-SAT extends successively a consistent partial assignment using a complete assignment as guidance for variable-ordering. To extend the partial assignment, CH-SAT u...
متن کاملDRAFT-DO NOT CITE WITHOUT PERMISSION The structure-sensitivity of memory access: evidence from Mandarin Chinese
The present study examined the processing of the Mandarin Chinese long-distance reflexive ziji to evaluate the role that syntactic structure plays in the memory retrieval operations that support sentence comprehension. Using the multiple-response speed-accuracy tradeoff (MR-SAT) paradigm, we measured the speed with which comprehenders retrieve an antecedent for ziji. Our experimental materials ...
متن کاملDiversification and Intensification in Parallel SAT Solving
In this paper, we explore the two well-known principles of diversification and intensification in portfolio-based parallel SAT solving. These dual concepts play an important role in several search algorithms including local search, and appear to be a key point in modern parallel SAT solvers. To study their tradeoff, we define two roles for the computational units. Some of them classified as Mas...
متن کاملTabu Search for SAT
In this paper tabu search for SAT is investi gated from an experimental point of view To this end TSAT a basic tabu search algorithm for SAT is introduced and compared with Selman et al Random Walk Strategy GSAT procedure in short RWS GSAT TSAT does not involve the ad ditional stochastic process of RWS GSAT This should facilitate the understanding of why simple local search methods for SAT work...
متن کامل